Vector-Circulant Matrices and Vector-Circulant Based Additive Codes over Finite Fields
نویسنده
چکیده
Circulant matrices have attracted interest due to their rich algebraic structures and various applications. In this paper, the concept of vector-circulant matrices over finite fields is studied as a generalization of circulant matrices. The algebraic characterization for such matrices has been discussed. As applications, constructions of vector-circulant based additive codes over finite fields have been given together with some examples of optimal additive codes over F4.
منابع مشابه
Adjacency matrices of polarity graphs and of other C4-free graphs of large size
Main talks 1. Simeon Ball, On subsets of a finite vector space in which every subset of basis size is a basis 2. Simon Blackburn, Honeycomb arrays 3. Gàbor Korchmàros, Curves over finite fields, an approach from finite geometry 4. Cheryl Praeger, Basic pregeometries 5. Bernhard Schmidt, Finiteness of circulant weighing matrices of fixed weight 6. Douglas Stinson, Multicollision attacks on itera...
متن کاملCirculant Arrays on Cyclic Subgroups of Finite Fields: Rank Analysis and Construction of Quasi-Cyclic LDPC Codes
This paper consists of three parts. The first part presents a large class of new binary quasi-cyclic (QC)-LDPC codes with girth of at least 6 whose parity-check matrices are constructed based on cyclic subgroups of finite fields. Experimental results show that the codes constructed perform well over the binary-input AWGN channel with iterative decoding using the sum-product algorithm (SPA). The...
متن کاملA circulant approach to skew-constacyclic codes
We introduce circulant matrices that capture the structure of a skew-polynomial ring F[x; θ] modulo the left ideal generated by a polynomial of the type x − a. This allows us to develop an approach to skew-constacyclic codes based on such circulants. Properties of these circulants are derived, and in particular it is shown that the transpose of a certain circulant is a circulant again. This rec...
متن کاملDouble and bordered α-circulant self-dual codes over finite commutative chain rings
MICHAEL KIERMAIER, ALFRED WASSERMANN michael.kiermaier, [email protected] Mathematical Department, University of Bayreuth, D-95440 Bayreuth, GERMANY Abstract. In this paper we investigate codes over finite commutative rings R, whose generator matrices are built from α-circulant matrices. For a non-trivial ideal I < R we give a method to lift such codes over R/I to codes over R, ...
متن کاملGraph-based classification of self-dual additive codes over finite fields
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the generalized local complementation operation correspond to equivalence classes of codes. We have previously used this fact to classify self-dual additive codes over F4. In this paper we classify selfdual additive codes over ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Information
دوره 8 شماره
صفحات -
تاریخ انتشار 2017